import java.math.BigInteger;
import java.util.List;
import java.util.ArrayList;

public class problem53 {
    public static BigInteger factorial(BigInteger number) {
       if (number.compareTo(BigInteger.ONE) <= 0) {
           return number;
       } else {
           return number.multiply(factorial(number.subtract(BigInteger.ONE)));
       }
    }

    public static BigInteger combination(BigInteger n, BigInteger r) {
        return factorial(n).divide(factorial(r).multiply(factorial(n.subtract(r))));
    }

    public static void main(String[] args) {
        List<BigInteger> numbers = new ArrayList<BigInteger>();
        for(BigInteger counter = new BigInteger("2"); counter.compareTo(new BigInteger("100")) <= 0; counter = counter.add(BigInteger.ONE)) {
            for(BigInteger counter2 = BigInteger.ONE; counter2.compareTo(counter) < 0; counter2 = counter2.add(BigInteger.ONE)) {
                BigInteger combo = combination(counter, counter2);
                if (combo.compareTo(new BigInteger("1000000")) > 0) {
                    System.out.println(counter + " " + counter2 + " " + combo);
                    numbers.add(combo);
                }
            }
        }
        System.out.println(numbers.size());
    }
}
